- - - - Constant - time pattern matching for real - time production systems Dale
نویسندگان
چکیده
__________ Many intelligent systems must respond to sensory data or critical environmental conditions in fixed, predictable time. Rule-based systems, including those based on the efficient Rete matching algorithm, cannot guarantee this result. Improvement in execution-time efficiency is not all that is needed here; it is important to ensure constant, O(1) time limits for portions of the matching process. Our approach is inspired by two observations about human performance. First, cognitive psychologists distinguish between automatic and controlled processing. Analogously, we partition the matching process across two networks. The first is the automatic partition; it is characterized by predictable O(1) time and space complexity, lack of persistent memory, and is reactive in nature. The second is the controlled partition; it includes the search-based goal-driven and data-driven processing typical of most production system programming. The former is responsible for recognition and response to critical environmental conditions. The latter is responsible for the more flexible problem-solving behaviors consistent with the notion of intelligence. Support for learning and refining the automatic partition can be placed in the controlled partition. Our second observation is that people are able to attend to more critical stimuli or requirements selectively. Our match algorithm uses priorities to focus matching. It compares priority of information during matching, rather than deferring this comparison until conflict resolution. Messages from the automatic partition are able to interrupt the controlled partition, enhancing system responsiveness. Our algorithm has numerous applications for systems that must exhibit time-constrained behavior.
منابع مشابه
Frontiers in Run-Time Prediction for the Production-System Paradigm
acceptance of production systems in the industrial world. However, in embedded-control systems, production systems have not been applied intensively because of their nondeterministic run-time behavior. Thus, nonpredictability of response times is a major obstacle to the widespread use of expert systems in the real-time domain. The RETE and TREAT algorithms and their offspring play a major role ...
متن کاملAn Automatic Real Time Impedance Matching System for Use in an RF Electrostatics Accelerator Ion Source
متن کامل
Real-Time String Matching in Sublinear Space
We study a problem of efficient utilisation of extra memory space in real-time string matching. We propose, for any constant " > 0, a real-time string matching algorithm claiming O(m") extra space, where m is the size of a pattern. All previously known real-time string matching algorithms use (m) extra
متن کاملAn Efficient Preprocessing on the One-dimensional Real-scale Pattern Matching Problem
Given a pattern string P and a text string T , the one-dimensional real-scale pattern matching problem asks for all matched positions in T at which P occurs for some real scales ≥ 1. This problem was first proposed by Amir et al., who also gave an algorithm with O(n + |P |) time for solving it, where |T | = n. Recently, Wang et al. proposed a preprocessing on T with O(n) time and space, with wh...
متن کاملVehicle Logo Recognition Using Image Matching and Textural Features
In recent years, automatic recognition of vehicle logos has become one of the important issues in modern cities. This is due to the unlimited increase of cars and transportation systems that make it impossible to be fully managed and monitored by human. In this research, an automatic real-time logo recognition system for moving cars is introduced based on histogram manipulation. In the proposed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009